CP 312

Algorithm Design/Analysis I

Analysis of the best, average and worst-case behaviors of algorithms. Algorithmic strategies: brute force algorithms, greedy algorithms, divide-and-conquer, branch and bound, backtracking. Fundamental computing algorithms: O(n log n) sorting, hash table, binary trees, depth- and breadth-first search of graphs. Prerequisites: CP264 (or CP114 and CP213) and (CP214 or MA238).